Recognition and isomorphism of tree-like P4-connected graphs
نویسندگان
چکیده
منابع مشابه
A New Characterization of P4-connected Graphs
A graph is said to be P 4-connected if for every partition of its vertex-set into two nonempty disjoint sets, some P 4 in the graph has vertices from both sets in the partition. A P 4-chain is a sequence of vertices such that every four consecutive ones induce a P 4. The main result of this work states that a graph is P 4-connected if and only if each pair of vertices is connected by a P 4-chai...
متن کاملLinear time recognition of P4-indifference graphs
A P4 is a chordless path of four vertices. A graph is P4-indifference if it admits an ordering < on its vertex set such that every P4 abcd has a < b < c < d or d < c < b < a. Such an ordering is called a P4-indifference ordering. The P4-indifference graphs were introduced in [Chv84] as a particular class of perfectly orderable graphs. A graph is perfectly orderable if there exists an ordering o...
متن کاملLinear Time Recognition of P4-Indifferent Graphs
A simple graph is P4-indifferent if it admits a total order < on its nodes such that every chordless path with nodes a, b, c, d and edges ab, bc, cd has a < b < c < d or a > b > c > d. P4-indifferent graphs generalize indifferent graphs and are perfectly orderable. Recently, Hoàng, Maffray and Noy gave a characterization of P4-indifferent graphs in terms of forbidden induced subgraphs. We clari...
متن کاملOn the Recognition of P4-Comparability Graphs
We consider the problem of recognizing whether a simple undirected graph is a P4-comparability graph. This problem has been considered by Hoàng and Reed who described an O(n)-time algorithm for its solution, where n is the number of vertices of the given graph. Faster algorithms have recently been presented by Raschle and Simon and by Nikolopoulos and Palios; the time complexity of both algorit...
متن کامل2-Factors in r-Connected {K1,k, P4}-Free Graphs
In [3], Faudree et.al. considered the proposition “Every {X, Y }-free graph of sufficiently large order has a 2-factor,” and they determined those pairs {X, Y } which make this proposition true. Their result says that one of them is {X, Y } = {K1,4, P4}. In this paper, we investigate the existence of 2-factors in r-connected {K1,k, P4}-free graphs. We prove that if r ≥ 1 and k ≥ 2, and if G is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2000
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(99)00140-7